TWO COMPLEX COMBINATIONS AND COMPLEX INTERSECTION BODIES
نویسندگان
چکیده
منابع مشابه
Complex intersection bodies
We introduce complex intersection bodies and show that their properties and applications are similar to those of their real counterparts. In particular, we generalize Busemann’s theorem to the complex case by proving that complex intersection bodies of symmetric complex convex bodies are also convex. Other results include stability in the complex Busemann-Petty problem for arbitrary measures an...
متن کاملGeneralized Weierstrass Kernels on the Intersection of Two Complex Hypersurfaces
On plane algebraic curves the so-called Weierstrass kernel plays the same role of the Cauchy kernel on the complex plane. A straightforward prescription to construct the Weierstrass kernel is known since one century. How can it be extended to the case of more general curves obtained from the intersection of hypersurfaces in a n dimensional complex space? This problem is solved in this work in t...
متن کاملVolume difference inequalities for the projection and intersection bodies
In this paper, we introduce a new concept of volumes difference function of the projection and intersection bodies. Following this, we establish the Minkowski and Brunn-Minkowski inequalities for volumes difference function of the projection and intersection bodies.
متن کاملColouring random intersection graphs and complex networks
Random intersection graphs naturally exhibit a certain amount of transitivity and hence can be used to model real–world networks. We study the evolution of the chromatic number of a random intersection graph and show that, in a certain range of parameters, these random graphs can be coloured optimally with high probability using different greedy algorithms. Experiments on real network data conf...
متن کاملColoring Random Intersection Graphs and Complex Networks
Random intersection graphs naturally exhibit a certain amount of transitivity and hence can be used to model real–world networks. We study the evolution of the chromatic number of a random intersection graph and show that, in a certain range of parameters, these random graphs can be coloured optimally with high probability using different greedy algorithms. Experiments on real network data conf...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Taiwanese Journal of Mathematics
سال: 2014
ISSN: 1027-5487
DOI: 10.11650/tjm.18.2014.3904